Optimal direct sum results for deterministic and randomized decision tree complexity
نویسندگان
چکیده
منابع مشابه
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Sum Theorems hold in the models of deterministic and randomized decision trees for all relations. We also note that a near optimal Direct Sum Theorem holds for quantum decision trees for boolean functions.
متن کاملOptimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity
We show optimal Direct Sum result for the one-way entanglement-assisted quantum communication complexity for any relation f ⊆ X × Y × Z. We show: Q(f) = Ω(m · Q(f)), where Q(f), represents the one-way entanglement-assisted quantum communication complexity of f with error at most 1/3 and f⊕m represents m-copies of f . Similarly for the one-way public-coin classical communication complexity we sh...
متن کاملglobal results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
Improved bounds for the randomized decision tree complexity
We consider the randomized decision tree complexity of the recursive 3-majority function. We prove a lower bound of (1/2 − δ) · 2.57143 for the two-sided-error randomized decision tree complexity of evaluating height h formulae with error δ ∈ [0, 1/2). This improves the lower bound of (1 − 2δ)(7/3) given by Jayram, Kumar, and Sivakumar (STOC’03), and the one of (1 − 2δ) · 2.55 given by Leonardo...
متن کاملComplexity results for minimum sum edge coloring
In the Minimum Sum Edge Coloring problem we have to assign positive integers to the edges of a graph such that adjacent edges receive different integers and the sum of the assigned numbers is minimal. We show that the problem is (a) NP-hard for planar bipartite graphs with maximum degree 3, (b) NP-hard for 3-regular planar graphs, (c) NP-hard for partial 2-trees, and (d) APX-hard for bipartite ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2010
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2010.07.020